منابع مشابه
Weak Homomorphisms of Coalgebras
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv CHAPTER
متن کاملLattice Homomorphisms Induced by Group Homomorphisms
Introduction. By a lattice homorphism of a group G onto a group G' we mean a single-valued mapping of the lattice L(G) of subgroups of G onto the lattice L(G') of subgroups of G', which preserves all unions and intersections, that is, which is subject to the conditions 1. (U,S,)0 = U,(S¿), 2. (r\vSr) = Ç)ASd>), for every (finite or infinite) set of subgroups 5„ of G. We call proper any l...
متن کاملUniversal Cycles for Weak Orders
Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1992. They have been developed by many authors since, for various combinatorial objects such as strings, subsets, permutations, partitions, vector spaces, and designs. One generalization of universal cycles, which require almost complete overlap of consecutiv...
متن کاملMeasuring Consensus in Weak Orders
In this chapter we focus our attention in how to measure consensus in groups of voters when they show their preferences over a fixed set of alternatives or candidates by means of weak orders (complete preorders). We have introduced a new class of consensus measures on weak orders based on distances, and we have analyzed some of their properties paying special attention to seven well-known dista...
متن کاملIdeal of Lattice homomorphisms corresponding to the products of two arbitrary lattices and the lattice [2]
Abstract. Let L and M be two finite lattices. The ideal J(L,M) is a monomial ideal in a specific polynomial ring and whose minimal monomial generators correspond to lattice homomorphisms ϕ: L→M. This ideal is called the ideal of lattice homomorphism. In this paper, we study J(L,M) in the case that L is the product of two lattices L_1 and L_2 and M is the chain [2]. We first characterize the set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/7914